Unordered Task-Parallel Augmented Merge Tree Construction
نویسندگان
چکیده
منابع مشابه
Unordered Merge and Its Linearization
In the Minimalist Program (Chomsky 1995), Merge is a set operation that imposes no intrinsic ordering among its members. However, syntactic structures are linearized into strings of words at PF. This paper proposes that in order for a Merger set to be linearized, its members must be either hierarchically displaced or morphologically fused into a single terminal node. The empirical study focuses...
متن کاملBit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
The following tree pattern matching problem is considered: Given two unordered labeled trees P and T , find all occurrences of P in T . Here P and T are called a pattern tree and a target tree, respectively. We first introduce a new problem called the pseudo-tree pattern matching problem. Then we show two efficient bit-parallel algorithms for the pseudo-tree pattern matching problem. One runs i...
متن کاملParallel Merge Sort on a Binary Tree On-Chip Network
Recently, advances in the microelectronics technology enable us to integrate increasingly more processor cores in a single chip. As the chip density continues to grow, the communication latency compared to the computation time is becoming a dominant factor in modern single chip multiprocessors systems. Consequently, networks on a chip (NoC) have been introduced as an alternative to shared busse...
متن کاملFaster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism
In this paper, we consider the unordered pseudo-tree matching problem, which is a problem of, given two unordered labeled trees P and T , finding all occurrences of P in T via such many-to-one matchings that preserve node labels and parent-child relationship. This problem is closely related to the tree pattern matching problem for XPath queries with child axis only. If m > w, we present an effi...
متن کاملAsynchronous Parallel Construction of Recursive Tree Hierarchies
Multi-resolution methods are widely used in scientific visualization, image processing, and computer graphics. While many applications only require an one-time construction of these data-structures which can be done in a preprocess, this pre-process can take a significant amount of time. Considering large datasets, this time consumption can range from several minutes up to several hours, especi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2021
ISSN: 1077-2626,1941-0506,2160-9306
DOI: 10.1109/tvcg.2021.3076875